Expressing Reachability in Linear Recurrences, as Infinite Determinants and Rational Polynomial Equations
نویسنده
چکیده
We present two tools, which could be useful in determining whether or not a non-Homogenous Linear Recurrence can reach a desired rational. First, we derive the determinant that is equal to the i term in a non-Homogenous Linear Recurrence. We use this to derive the infinite determinant that is zero, if and only if, the desired rational can be reached by some term in the recurrence. Second, we derive an infinite summation of rational Polynomials, such that this summation can be equal to 1, if and only if, the desired rational can be reached by some term in the recurrence.
منابع مشابه
Algebraic independence of functions satisfying certain Mahler type functional equations and its applications
One of the techniques used to prove the algebraic independence of numbers is Mahler’s method, which deals with the values of so-called Mahler functions satisfying a certain type of functional equation. In order to apply the method, one must confirm the algebraic independence of the Mahler functions themselves. This can be reduced, in many cases, to their linear independence modulo the rational ...
متن کاملLinear Recurrences, Linear Diierential Equations, and Fast Computation 1. Classical Algorithms concerning Formal Power Series
summary by Philippe Dumas] Linear recurrences and linear diierential equations with polynomial coeecients provide a nite representation of special functions or special sequences. Many algorithms are at our disposal; some give a way to automate the computation of recurrences or diierential equations; some provide solutions to recurrences or diierential equations; and some give the asymptotic beh...
متن کاملEeective Asymptotics of Linear Recurrences with Rational Coeecients
We give algorithms to compute the asymptotic expansion of solutions of linear recurrences with rational coeecients and rational initial conditions in polynomial time in the order of the recurrence.
متن کاملAlgebraic Algorithms
This is a preliminary version of a Chapter on Algebraic Algorithms in the upcoming Computing Handbook Set Computer Science (Volume I), CRCPress/Taylor and Francis Group. Algebraic algorithms deal with numbers, vectors, matrices, polynomials, formal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation wit...
متن کاملApplication of measures of noncompactness to infinite system of linear equations in sequence spaces
G. Darbo [Rend. Sem. Math. Univ. Padova, 24 (1955) 84--92] used the measure of noncompactness to investigate operators whose properties can be characterized as being intermediate between those of contraction and compact operators. In this paper, we apply the Darbo's fixed point theorem for solving infinite system of linear equations in some sequence spaces.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1201.0572 شماره
صفحات -
تاریخ انتشار 2012